Minimal Height and Sequence Constrained Longest Increasing Subsequence
نویسندگان
چکیده
Given a string S = a1a2a3 · · · an, the longest increasing subsequence (LIS) problem is to find a subsequence of S such that the subsequence is increasing and its length is maximal. In this paper, we propose and solve two variants of the LIS problem. The first one is the minimal height LIS where the height means the difference between the greatest and smallest elements. We propose an algorithm with O(n log n) time and O(n) space to solve it. The second one is the sequence constrained LIS that given a sequence S and a constraint C, we are to find the LIS of S containing C as its subsequence. We propose an algorithm with O(n log(n + |C|)) time to solve it.
منابع مشابه
On Some Variants of the Longest Increasing Subsequence Problem
The problem of finding a longest increasing subsequence (LIS) is a well known task in sequence processing. There are many variants of the basic task. We discuss a recently introduced variant of LIS, a minimal height longest increasing subsequence problem and propose a new algorithm for it, which improves its time complexity. Moreover, we define a family of similar problems and introduce algorit...
متن کاملFast Algorithms for the Constrained Longest Increasing Subsequence Problems
Let 〈a1, a2, . . . , an〉 be a sequence of comparable elements. In this paper, we study two constrained versions of the longest increasing subsequence (LIS) problem. The first problem is the range-constrained longest increasing subsequence (RLIS) problem. Given 0 < LI ≤ UI < n and 0 ≤ LV ≤ UV , the objective of the RLIS problem is to deliver a maximum-length increasing subsequence 〈ai1 , ai2 , ....
متن کاملA simple algorithm for the constrained sequence problems
In this paper we address the constrained longest common subsequence problem. Given two sequences X , Y and a constrained sequence P , a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest subsequence of X and Y such that P is a subsequence of Z. Recently, Tsai [7] proposed an O(n ·m · r) time algorithm to solve this problem using dynamic prog...
متن کاملFinding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences
By reviewing Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS), the Longest Common Increasing Subsequence (LCIS) problem is explored for two non-random input cases in details. Specifically, we designed two algorithms, one solving the input sequence scenario with the case that one sequence is ordered and duplicate elements are allowed in each of sequences, and the second ...
متن کاملAn Algorithm and Applications to Sequence Alignment with Weighted Constraints
Given two sequences S1, S2, and a constrained sequence C, a longest common subsequence of S1, S2 with restriction to C is called a constrained longest common subsequence of S1 and S2 with C. At the same time, an optimal alignment of S1, S2 with restriction to C is called a constrained pairwise sequence alignment of S1 and S2 with C. Previous algorithms have shown that the constrained longest co...
متن کامل